TSTP Solution File: ITP246^3 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : ITP246^3 : TPTP v8.1.2. Released v8.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n025.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sat May  4 08:07:48 EDT 2024

% Result   : Theorem 37.46s 14.28s
% Output   : CNFRefutation 37.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   20
% Syntax   : Number of formulae    :   34 (  16 unt;  14 typ;   0 def)
%            Number of atoms       :   28 (  13 equ;   0 cnn)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :  160 (  11   ~;   8   |;   0   &; 141   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :    9 (   9   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   14 (  12 usr;   7 con; 0-2 aty)
%            Number of variables   :    8 (   0   ^   8   !;   0   ?;   8   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    nat: $tType ).

thf(decl_sort2,type,
    num: $tType ).

thf(decl_277,type,
    one_one_nat: nat ).

thf(decl_462,type,
    suc: nat > nat ).

thf(decl_527,type,
    bit0: num > num ).

thf(decl_529,type,
    one: num ).

thf(decl_537,type,
    numeral_numeral_nat: num > nat ).

thf(decl_593,type,
    ord_less_eq_nat: nat > nat > $o ).

thf(decl_711,type,
    divide_divide_nat: nat > nat > nat ).

thf(decl_842,type,
    vEBT_VEBT_high: nat > nat > nat ).

thf(decl_903,type,
    deg: nat ).

thf(decl_908,type,
    na: nat ).

thf(decl_913,type,
    xa: nat ).

thf(decl_914,type,
    za: nat ).

thf(fact_49_verit__la__disequality,axiom,
    ! [X36: nat,X37: nat] :
      ( ( X36 = X37 )
      | ~ ( ord_less_eq_nat @ X36 @ X37 )
      | ~ ( ord_less_eq_nat @ X37 @ X36 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.fZ82iDxlqh/E---3.1_22530.p',fact_49_verit__la__disequality) ).

thf(fact_5__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062,axiom,
    ( ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) )
    = na ),
    file('/export/starexec/sandbox2/tmp/tmp.fZ82iDxlqh/E---3.1_22530.p',fact_5__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062) ).

thf(fact_335_Suc__1,axiom,
    ( ( suc @ one_one_nat )
    = ( numeral_numeral_nat @ ( bit0 @ one ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.fZ82iDxlqh/E---3.1_22530.p',fact_335_Suc__1) ).

thf(conj_0,conjecture,
    ( ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) )
    = ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.fZ82iDxlqh/E---3.1_22530.p',conj_0) ).

thf(fact_0_bbbb,axiom,
    ord_less_eq_nat @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.fZ82iDxlqh/E---3.1_22530.p',fact_0_bbbb) ).

thf(fact_2_aaaa,axiom,
    ord_less_eq_nat @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.fZ82iDxlqh/E---3.1_22530.p',fact_2_aaaa) ).

thf(c_0_6,plain,
    ! [X36: nat,X37: nat] :
      ( ( X36 = X37 )
      | ~ ( ord_less_eq_nat @ X36 @ X37 )
      | ~ ( ord_less_eq_nat @ X37 @ X36 ) ),
    inference(fof_simplification,[status(thm)],[fact_49_verit__la__disequality]) ).

thf(c_0_7,plain,
    ( ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) )
    = na ),
    inference(split_conjunct,[status(thm)],[fact_5__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062]) ).

thf(c_0_8,plain,
    ( ( suc @ one_one_nat )
    = ( numeral_numeral_nat @ ( bit0 @ one ) ) ),
    inference(split_conjunct,[status(thm)],[fact_335_Suc__1]) ).

thf(c_0_9,negated_conjecture,
    ( ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) )
   != ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).

thf(c_0_10,plain,
    ! [X28209: nat,X28210: nat] :
      ( ( X28209 = X28210 )
      | ~ ( ord_less_eq_nat @ X28209 @ X28210 )
      | ~ ( ord_less_eq_nat @ X28210 @ X28209 ) ),
    inference(variable_rename,[status(thm)],[c_0_6]) ).

thf(c_0_11,plain,
    ord_less_eq_nat @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ),
    inference(split_conjunct,[status(thm)],[fact_0_bbbb]) ).

thf(c_0_12,plain,
    ( ( divide_divide_nat @ deg @ ( suc @ one_one_nat ) )
    = na ),
    inference(rw,[status(thm)],[c_0_7,c_0_8]) ).

thf(c_0_13,plain,
    ord_less_eq_nat @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ),
    inference(split_conjunct,[status(thm)],[fact_2_aaaa]) ).

thf(c_0_14,negated_conjecture,
    ( ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) )
   != ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_15,plain,
    ! [X3: nat,X2: nat] :
      ( ( X2 = X3 )
      | ~ ( ord_less_eq_nat @ X2 @ X3 )
      | ~ ( ord_less_eq_nat @ X3 @ X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

thf(c_0_16,plain,
    ord_less_eq_nat @ ( vEBT_VEBT_high @ za @ na ) @ ( vEBT_VEBT_high @ xa @ na ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_8]),c_0_12]),c_0_8]),c_0_12]) ).

thf(c_0_17,plain,
    ord_less_eq_nat @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_VEBT_high @ za @ na ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_8]),c_0_12]),c_0_8]),c_0_12]) ).

thf(c_0_18,negated_conjecture,
    ( ( vEBT_VEBT_high @ za @ na )
   != ( vEBT_VEBT_high @ xa @ na ) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_7]),c_0_7]) ).

thf(c_0_19,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),c_0_18]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 2.68/2.71  % Problem    : ITP246^3 : TPTP v8.1.2. Released v8.1.0.
% 2.72/2.72  % Command    : run_E %s %d THM
% 2.72/2.93  % Computer : n025.cluster.edu
% 2.72/2.93  % Model    : x86_64 x86_64
% 2.72/2.93  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 2.72/2.93  % Memory   : 8042.1875MB
% 2.72/2.93  % OS       : Linux 3.10.0-693.el7.x86_64
% 2.72/2.93  % CPULimit   : 300
% 2.72/2.93  % WCLimit    : 300
% 2.72/2.93  % DateTime   : Fri May  3 13:03:47 EDT 2024
% 2.72/2.93  % CPUTime    : 
% 5.40/5.62  Running higher-order theorem proving
% 5.40/5.62  Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.fZ82iDxlqh/E---3.1_22530.p
% 37.46/14.28  # Version: 3.1.0-ho
% 37.46/14.28  # partial match(1): HMLMSMSMSSLCHFA
% 37.46/14.28  # Preprocessing class: HMLMSMLMSSLCHFA.
% 37.46/14.28  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 37.46/14.28  # Starting new_ho_10 with 1500s (5) cores
% 37.46/14.28  # Starting sh5l with 300s (1) cores
% 37.46/14.28  # Starting new_bool_1 with 300s (1) cores
% 37.46/14.28  # Starting new_bool_2 with 300s (1) cores
% 37.46/14.28  # new_bool_2 with pid 22612 completed with status 0
% 37.46/14.28  # Result found by new_bool_2
% 37.46/14.28  # partial match(1): HMLMSMSMSSLCHFA
% 37.46/14.28  # Preprocessing class: HMLMSMLMSSLCHFA.
% 37.46/14.28  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 37.46/14.28  # Starting new_ho_10 with 1500s (5) cores
% 37.46/14.28  # Starting sh5l with 300s (1) cores
% 37.46/14.28  # Starting new_bool_1 with 300s (1) cores
% 37.46/14.28  # Starting new_bool_2 with 300s (1) cores
% 37.46/14.28  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 37.46/14.28  # Search class: HGHSM-SMLM32-DHFFFSBN
% 37.46/14.28  # Scheduled 5 strats onto 1 cores with 299 seconds (299 total)
% 37.46/14.28  # Starting new_ho_10 with 180s (1) cores
% 37.46/14.28  # new_ho_10 with pid 22765 completed with status 0
% 37.46/14.28  # Result found by new_ho_10
% 37.46/14.28  # partial match(1): HMLMSMSMSSLCHFA
% 37.46/14.28  # Preprocessing class: HMLMSMLMSSLCHFA.
% 37.46/14.28  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 37.46/14.28  # Starting new_ho_10 with 1500s (5) cores
% 37.46/14.28  # Starting sh5l with 300s (1) cores
% 37.46/14.28  # Starting new_bool_1 with 300s (1) cores
% 37.46/14.28  # Starting new_bool_2 with 300s (1) cores
% 37.46/14.28  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 37.46/14.28  # Search class: HGHSM-SMLM32-DHFFFSBN
% 37.46/14.28  # Scheduled 5 strats onto 1 cores with 299 seconds (299 total)
% 37.46/14.28  # Starting new_ho_10 with 180s (1) cores
% 37.46/14.28  # Preprocessing time       : 0.301 s
% 37.46/14.28  # Presaturation interreduction done
% 37.46/14.28  
% 37.46/14.28  # Proof found!
% 37.46/14.28  # SZS status Theorem
% 37.46/14.28  # SZS output start CNFRefutation
% See solution above
% 37.46/14.28  # Parsed axioms                        : 11234
% 37.46/14.28  # Removed by relevancy pruning/SinE    : 7424
% 37.46/14.28  # Initial clauses                      : 9458
% 37.46/14.28  # Removed in clause preprocessing      : 1911
% 37.46/14.28  # Initial clauses in saturation        : 7547
% 37.46/14.28  # Processed clauses                    : 9616
% 37.46/14.28  # ...of these trivial                  : 327
% 37.46/14.28  # ...subsumed                          : 2061
% 37.46/14.28  # ...remaining for further processing  : 7228
% 37.46/14.28  # Other redundant clauses eliminated   : 1532
% 37.46/14.28  # Clauses deleted for lack of memory   : 0
% 37.46/14.28  # Backward-subsumed                    : 58
% 37.46/14.28  # Backward-rewritten                   : 91
% 37.46/14.28  # Generated clauses                    : 4145
% 37.46/14.28  # ...of the previous two non-redundant : 2771
% 37.46/14.28  # ...aggressively subsumed             : 0
% 37.46/14.28  # Contextual simplify-reflections      : 112
% 37.46/14.28  # Paramodulations                      : 2828
% 37.46/14.28  # Factorizations                       : 0
% 37.46/14.28  # NegExts                              : 0
% 37.46/14.28  # Equation resolutions                 : 1557
% 37.46/14.28  # Disequality decompositions           : 0
% 37.46/14.28  # Total rewrite steps                  : 6360
% 37.46/14.28  # ...of those cached                   : 5507
% 37.46/14.28  # Propositional unsat checks           : 0
% 37.46/14.28  #    Propositional check models        : 0
% 37.46/14.28  #    Propositional check unsatisfiable : 0
% 37.46/14.28  #    Propositional clauses             : 0
% 37.46/14.28  #    Propositional clauses after purity: 0
% 37.46/14.28  #    Propositional unsat core size     : 0
% 37.46/14.28  #    Propositional preprocessing time  : 0.000
% 37.46/14.28  #    Propositional encoding time       : 0.000
% 37.46/14.28  #    Propositional solver time         : 0.000
% 37.46/14.28  #    Success case prop preproc time    : 0.000
% 37.46/14.28  #    Success case prop encoding time   : 0.000
% 37.46/14.28  #    Success case prop solver time     : 0.000
% 37.46/14.28  # Current number of processed clauses  : 960
% 37.46/14.28  #    Positive orientable unit clauses  : 426
% 37.46/14.28  #    Positive unorientable unit clauses: 12
% 37.46/14.28  #    Negative unit clauses             : 208
% 37.46/14.28  #    Non-unit-clauses                  : 314
% 37.46/14.28  # Current number of unprocessed clauses: 5719
% 37.46/14.28  # ...number of literals in the above   : 19638
% 37.46/14.28  # Current number of archived formulas  : 0
% 37.46/14.28  # Current number of archived clauses   : 5190
% 37.46/14.28  # Clause-clause subsumption calls (NU) : 15818446
% 37.46/14.28  # Rec. Clause-clause subsumption calls : 1359008
% 37.46/14.28  # Non-unit clause-clause subsumptions  : 1722
% 37.46/14.28  # Unit Clause-clause subsumption calls : 59724
% 37.46/14.28  # Rewrite failures with RHS unbound    : 0
% 37.46/14.28  # BW rewrite match attempts            : 1205
% 37.46/14.28  # BW rewrite match successes           : 426
% 37.46/14.28  # Condensation attempts                : 9616
% 37.46/14.28  # Condensation successes               : 36
% 37.46/14.28  # Termbank termtop insertions          : 2831191
% 37.46/14.28  # Search garbage collected termcells   : 175950
% 37.46/14.28  
% 37.46/14.28  # -------------------------------------------------
% 37.46/14.28  # User time                : 7.646 s
% 37.46/14.28  # System time              : 0.128 s
% 37.46/14.28  # Total time               : 7.774 s
% 37.46/14.28  # Maximum resident set size: 45632 pages
% 37.46/14.28  
% 37.46/14.28  # -------------------------------------------------
% 37.46/14.28  # User time                : 8.294 s
% 37.46/14.28  # System time              : 0.160 s
% 37.46/14.28  # Total time               : 8.454 s
% 37.46/14.28  # Maximum resident set size: 25116 pages
% 37.46/14.28  % E---3.1 exiting
% 37.46/14.29  % E exiting
%------------------------------------------------------------------------------